منابع مشابه
Inferring Network Invariants Automatically
Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P , a network invariant for P is a system that abstracts the composition of every number of copies of P running in parallel. If there is such a network invariant, by reasoning about it, uniform verification with respect to the family P [1] ‖ · · · ‖ P [n] can be carried out. ...
متن کاملFast Algorithms for Inferring Evolutionary Trees
We present algorithms for the perfect phylogeny problem restricted to binary characters. The first algorithm is faster than a previous algorithm by Gusfield when the input matrix for the problem is sparse. Next, we present two online algorithms. For the first of these, the set of species is fixed and the characters are given as input one at a time, while, for the second, the set of characters i...
متن کاملInferring Gene Regulatory Network Structure
Inferring the network structure of gene regulatory networks is one of the most important problems in contemporary bioinformatics. We analyze different methodologies for inferring small to very large sized gene networks. We use the datasets of DREAM 3 in-silico network challenge that is provided online [1]. The challenge involves inferring primarily the network structure from steady state gene e...
متن کاملInferring Centrality from Network Snapshots
The topology and dynamics of a complex network shape its functionality. However, the topologies of many large-scale networks are either unavailable or incomplete. Without the explicit knowledge of network topology, we show how the data generated from the network dynamics can be utilised to infer the tempo centrality, which is proposed to quantify the influence of nodes in a consensus network. W...
متن کاملInferring Network Structure from Cascades
Many physical, biological, and social phenomena can be described by cascades taking place on a network. Often, the activity can be empirically observed, but not the underlying network of interactions. In this paper we offer three topological methods to infer the structure of any directed network given a set of cascade arrival times. Our formulas hold for a very general class of models where the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Research Notes
سال: 2020
ISSN: 1756-0500
DOI: 10.1186/s13104-020-05371-0